Search and Adverse Selection∗

نویسندگان

  • Stephan Lauermann
  • Asher Wolinsky
چکیده

This paper explores a dynamic model of adverse selection in which trading partners receive noisy information. A monopolistic buyer wants to procure service. Seller’s cost depend on the buyer’s type. The buyer contacts sellers sequentially and enters into a bilateral bargaining game. Each seller observes the buyer’s offer. In addition, each seller observes a noisy signal. Contacting sellers (search) is costly. We characterize equilibrium when search cost become small. In the limit, the price will depend in a simple way on the curvature of the signal distribution. If signals are suffi ciently strong, the limit outcome is equivalent to the full information outcome. (The equilibrium is separating and prices are equal to the true cost.) If signals are weak, the limit outcome is equivalent to an outcome with no information. (The equilibrium is pooling and prices are equal to ex ante expected cost.) The effi ciency of the limit is closely tied to whether or not limit prices are separating or pooling. Intuitively, search cost reduce the winner’s curse by reducing excessive search by bad types. Away from the limit, a dynamic model of adverse selection with noisy information has several natural implications for the correlation between duration, quality, and prices. Most importantly, in many equilibria it will be the "lemons" that stay in the market for a long time, while good types trade fast. This is in accord with stylized facts about the housing or the labor market. Very preliminary and Incomplete. Appendix not included JEL Classifications: D44, D82, D83

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effect of Deviation from Optimal Cash Level on Adverse Selection and Moral Hazard in Firms Listed on Tehran Stock Exchange

This study aims to investigate the impact of deviation from optimal level of cash holdings on adverse selection and moral hazard problems. The data set includes 106 listed firms of Tehran Stock Exchange during the period of 2005-2016 and both panel data and cross-sectional data multivariate regressions were utilized in different stage of analysis to test the hypotheses. According to the optimal...

متن کامل

Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem

Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we  optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...

متن کامل

A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network

Abstract   Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...

متن کامل

The Analysis of the Existence of the Hypothesis of Adverse Selection on the Relationship between Off-balance Sheet Items and the Bank's Risk

Balance sheet itself does not specify and show all the activities that a bank pays. Because banks can do many swap contracts and obligations, exchange, and commitments Outside of the balance sheet. To such activities and exchange that will not appear on the balance sheet, are saying off-balance sheet activities. These items are usually reported in the notes to the attached financial statements....

متن کامل

Hybrid Probabilistic Search Methods for Simulation Optimization

Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009